Solving Gpo Ordering Constraints with a Shared Term Data Structure
نویسندگان
چکیده
We present here an algorithm for proving termination of term rewriting systems by gpo ordering constraint solving. Constraint solving is done eeciently thanks to an original shared term data structure based on SOUR graphs. We show how the algorithm works for proving termination of self-embedding rules like ffx ! fgfx. For particular cases of gpo like lpo, the algorithm is fully automatic. We give here execution examples of an implementation we made for lpo case.
منابع مشابه
Termination Proofs Using gpo Ordering Constraints
We present here an algorithm for proving termination of term rewriting systems by gpo ordering constraint solving. The algorithm gives, as automatically as possible, an appropriate instance of the gpo generic ordering proving termination of a given system. Constraint solving is done eeciently thanks to a DAG shared term data structure.
متن کاملTermination Proofs Using Gpo Ordering Constraints – Extended Version – N ˚ 3087 Termination Proofs Using Gpo Ordering Constraints
We present here an algorithm for proving termination of term rewriting systems by gpo ordering constraint solving. The algorithm gives, as automatically as possible, an appropriate instance of the gpo generic ordering, proving termination of a given system. Constraint solving is done eeciently thanks to a DAG shared term data structure. Preuves de terminaison par r esolution de contraintes d'or...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملThe Existential Theories of Term Algebras with the Knuth-Bendix Orderings are Decidable
We consider term algebras with simpliication orderings (which are mono-tonic, and well-founded). Solving constraints (quantiier-free formulas) in term algebras with this kind of orderings has several important applications like pruning search space in automated deduction and proving termination and connuence of term rewriting systems. Two kinds of ordering are normally used in automated deducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996